Models for the Optimization of Promotion Campaigns: Exact and Heuristic Algorithms
نویسندگان
چکیده
منابع مشابه
Heuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملheuristic and exact algorithms for generalized bin covering problem
in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملOptimization models for targeted offers in direct marketing: Exact and heuristic algorithms
This paper presents an optimization model for the selection of sets of clients that will receive an offer for one or more products during a promotion campaign. We show that the problem is strongly NP-hard and that it is unlikely that a constant-factor approximation algorithm can be proposed for solving this problem. We propose an alternative set-covering formulation and develop a branch-and-pri...
متن کاملExact and heuristic algorithms for Cograph Editing
We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an n-vertex graph that runs in O(3n) time and uses O(2) space. In this problem, we are given a graph G = (V,E) and the task is to find a smallest possible set F ⊆ V × V of vertex pairs such that (V,E4F ) is a cograph (or P4-free graph), where 4 represents the symmetric difference operator. We also de...
متن کاملHeuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
We are concerned with a variation of the standard 0–1 knapsack problem, where the values of items differ under possible S scenarios. By applying the ‘pegging test’ the ordinary knapsack problem can be reduced, often significantly, in size; but this is not directly applicable to our problem. We introduce a kind of surrogate relaxation to derive upper and lower bounds quickly, and show that, with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2008
ISSN: 1556-5068
DOI: 10.2139/ssrn.1290503